(0) Obligation:

Clauses:

n :- ','(=(X, f(1, f(0, X))), g(X)).
g(f(X, f(X, X1))) :- !.
g(f(X2, X)) :- g(X).

Query: n()

(1) PrologToDTProblemTransformerProof (SOUND transformation)

Built DT problem from termination graph DT10.

(2) Obligation:

Triples:


Clauses:


Afs:

(3) TPisEmptyProof (EQUIVALENT transformation)

There are no more dependency triples. Hence, the dependency triple problem trivially terminates.

(4) YES